OPTIMAL ROUTING OF CONTINUOUS TIMED PETRI NETS
نویسندگان
چکیده
منابع مشابه
Optimal control of timed continuous Petri nets via explicit MPC
In this paper we deal with the problem of controlling timed continuous Petri nets in order to reach a nal steady state con guration while minimizing a quadratic performance index The formulation of a discrete time linear positive model with dynamic or state based constraints on the control input enables us to design a state feedback control law based on explicit model predictive control eMPC Th...
متن کاملOn Controllability of Timed Continuous Petri Nets
Continuous Petri Nets is a subclass of hybrid models representing relaxed views of discrete events systems, in which timing may adopt different semantics. Even if no semantics is strictly superior, we proved in [1] that for an important subclass of models infinite server semantics provides always a better approximation of the underlying discrete model than finite server. This paper then concent...
متن کاملAsymptotic Throughput of Continuous Timed Petri Nets
We set up a connection between ContinuousTimed Petri Nets (the fluid version of usual Timed Petri Nets) and Markov decision processes. We characterize the subclass of Continuous Timed Petri Nets corresponding to undiscounted average cost structure. This subclass satisfies conservation laws and shows a linear growth: one obtains as mere application of existing results for Dynamic Programming the...
متن کاملTimed Petri Nets
In the early 60’s a young researcher in Darmstadt looked for a good representation for communicating systems processes that were mathematically sound and had, at the same time, a visual intuitive flavor. This event marked the beginning of a schematic approach that become very important to the modeling of distributed systems in several and distinct areas of knowledge, from Engineering to biologi...
متن کاملOptimal Observability for Continuous Petri Nets
Optimal observability of continuous Petri Nets consists in deciding the places to be measured (considering that all are measurable) such that the net system is observable and a cost function is minimal. Unfortunately this is not a simple covering problem. The results obtained in the paper are used in the implementation of an algorithm to improve the pure combinatorial search. Copyright c 2005 IFAC
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC Proceedings Volumes
سال: 2002
ISSN: 1474-6670
DOI: 10.3182/20020721-6-es-1901.00080